{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:26PDSIAI5NMTB7NW5YQSRWVJHJ","short_pith_number":"pith:26PDSIAI","canonical_record":{"source":{"id":"1111.3204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T13:22:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2cb816bb2906db4c62eee69837517d67b687cd55847065fc32ff9ba921cf687f","abstract_canon_sha256":"440869e59a08e7b19df6568bc051fb2451f8edc3eee12f20537bb92d833b1cfc"},"schema_version":"1.0"},"canonical_sha256":"d79e392008eb5930fdb6ee2128daa93a4e978c16a50083ccc4fa6ad377ad40ab","source":{"kind":"arxiv","id":"1111.3204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3204","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3204v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3204","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"26PDSIAI5NMT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"26PDSIAI5NMTB7NW","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"26PDSIAI","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:26PDSIAI5NMTB7NW5YQSRWVJHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T13:22:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2cb816bb2906db4c62eee69837517d67b687cd55847065fc32ff9ba921cf687f","abstract_canon_sha256":"440869e59a08e7b19df6568bc051fb2451f8edc3eee12f20537bb92d833b1cfc"},"schema_version":"1.0"},"canonical_sha256":"d79e392008eb5930fdb6ee2128daa93a4e978c16a50083ccc4fa6ad377ad40ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.040199Z","signature_b64":"3dFuHyf8WrbNCdVvnxMmNaJ+FC3ABwbwT0SKinBjLlAfWUA+W9gGntH3ecaRMTsDFo8TGMYMq2xYO4kR4naWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79e392008eb5930fdb6ee2128daa93a4e978c16a50083ccc4fa6ad377ad40ab","last_reissued_at":"2026-05-18T00:59:10.039428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.039428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3204","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSrhk/1CZvLczvcDsANIfyCYRY4upaHe1Dbxd0Dcdu/WRUIhF+YQvIPB8YvdZdSh1w2UTL2/+k9kJ0CNIMrqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:56:43.546815Z"},"content_sha256":"eebcadec2685644bd730da42bb0930a79d9896cc30f35e86ef43cf2e8389d0c4","schema_version":"1.0","event_id":"sha256:eebcadec2685644bd730da42bb0930a79d9896cc30f35e86ef43cf2e8389d0c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:26PDSIAI5NMTB7NW5YQSRWVJHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time Interference Alignment via Delay Offset for Long Delay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francesco Rossetto, Francisco Lazaro Blasco, Gerhard Bauch","submitted_at":"2011-11-14T13:22:51Z","abstract_excerpt":"Time Interference Alignment is a flavor of Interference Alignment that increases the network capacity by suitably staggering the transmission delays of the senders. In this work the analysis of the existing literature is generalized and the focus is on the computation of the dof for networks with randomly placed users in a n-dimensional Euclidean space. In the basic case without coordination among the transmitters analytical expressions of the sum dof can be derived. If the transmit delays are coordinated, in 20% of the cases time Interference Alignment yields additional dof with respect to or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3204","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PGA5Ez0RHDSgB0zQ+Se4hqivTq32fEyWtYhVNvNJ/qHQXaEAytcNKCnO35LUErUBayIqRY/1IOblf96XeZSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:56:43.547500Z"},"content_sha256":"0a8f060655ba0035f227ab75be0326554eadd0c1c198b170d74c5779fcf75948","schema_version":"1.0","event_id":"sha256:0a8f060655ba0035f227ab75be0326554eadd0c1c198b170d74c5779fcf75948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ/bundle.json","state_url":"https://pith.science/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T14:56:43Z","links":{"resolver":"https://pith.science/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ","bundle":"https://pith.science/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ/bundle.json","state":"https://pith.science/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26PDSIAI5NMTB7NW5YQSRWVJHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:26PDSIAI5NMTB7NW5YQSRWVJHJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"440869e59a08e7b19df6568bc051fb2451f8edc3eee12f20537bb92d833b1cfc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T13:22:51Z","title_canon_sha256":"2cb816bb2906db4c62eee69837517d67b687cd55847065fc32ff9ba921cf687f"},"schema_version":"1.0","source":{"id":"1111.3204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3204","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3204v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3204","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"26PDSIAI5NMT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"26PDSIAI5NMTB7NW","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"26PDSIAI","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:0a8f060655ba0035f227ab75be0326554eadd0c1c198b170d74c5779fcf75948","target":"graph","created_at":"2026-05-18T00:59:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Time Interference Alignment is a flavor of Interference Alignment that increases the network capacity by suitably staggering the transmission delays of the senders. In this work the analysis of the existing literature is generalized and the focus is on the computation of the dof for networks with randomly placed users in a n-dimensional Euclidean space. In the basic case without coordination among the transmitters analytical expressions of the sum dof can be derived. If the transmit delays are coordinated, in 20% of the cases time Interference Alignment yields additional dof with respect to or","authors_text":"Francesco Rossetto, Francisco Lazaro Blasco, Gerhard Bauch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T13:22:51Z","title":"Time Interference Alignment via Delay Offset for Long Delay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3204","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eebcadec2685644bd730da42bb0930a79d9896cc30f35e86ef43cf2e8389d0c4","target":"record","created_at":"2026-05-18T00:59:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"440869e59a08e7b19df6568bc051fb2451f8edc3eee12f20537bb92d833b1cfc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T13:22:51Z","title_canon_sha256":"2cb816bb2906db4c62eee69837517d67b687cd55847065fc32ff9ba921cf687f"},"schema_version":"1.0","source":{"id":"1111.3204","kind":"arxiv","version":1}},"canonical_sha256":"d79e392008eb5930fdb6ee2128daa93a4e978c16a50083ccc4fa6ad377ad40ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d79e392008eb5930fdb6ee2128daa93a4e978c16a50083ccc4fa6ad377ad40ab","first_computed_at":"2026-05-18T00:59:10.039428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.039428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dFuHyf8WrbNCdVvnxMmNaJ+FC3ABwbwT0SKinBjLlAfWUA+W9gGntH3ecaRMTsDFo8TGMYMq2xYO4kR4naWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.040199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eebcadec2685644bd730da42bb0930a79d9896cc30f35e86ef43cf2e8389d0c4","sha256:0a8f060655ba0035f227ab75be0326554eadd0c1c198b170d74c5779fcf75948"],"state_sha256":"8715fcbfbdef7f149388f288334565088ef6fa3d79e5ccfa9b446691f6e71e9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hY1u0cv0AIkADws8IbOrsppVP+w7EVE8f85xGfY0t7YA+/U/pWWg/jh1q7A02a7IeyzIsLRMX69rjBrnX2T6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:56:43.550554Z","bundle_sha256":"258e8fc7f9e19f48ed0984dca3ca286e43dc7791007e3a153f61727b04b00e78"}}