{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4HSQM6P2Z7VMAMMYFX3R3UWSPU","short_pith_number":"pith:4HSQM6P2","schema_version":"1.0","canonical_sha256":"e1e50679facfeac031982df71dd2d27d2f73890020895d3145001aee47c370a2","source":{"kind":"arxiv","id":"1207.1512","version":2},"attestation_state":"computed","paper":{"title":"Detailed Steps of the Fourier-Motzkin Elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tracey Ho, Xiaoli Xu, Yong Liang Guan, Yong Zeng","submitted_at":"2012-07-06T03:40:21Z","abstract_excerpt":"This file provide the detailed steps for obtaining the bounds on $R_1$, $R_2$ via the obtained results on $(R_{1c},R_{1p},R_{2c},R_{2p})$. It is subplementary material for the paper titled \"On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding\""},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.1512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-06T03:40:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8b1f4a828809161b599c4948d73bbee62e4e4c61cad968d4f1389937ba6fc491","abstract_canon_sha256":"ba69ec3dafcb8627d1b10ec35efb482624aaa70c414dd9e08ea6a6810658eb75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:34.853134Z","signature_b64":"McjQtyfA54zPNgjFSYlVQJB5L07/rwfUeK8an1WnEBdGZnRju/G+eKpzhRDv3pc+dEmrAu+wL3EL9+uS2C8OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1e50679facfeac031982df71dd2d27d2f73890020895d3145001aee47c370a2","last_reissued_at":"2026-05-18T03:51:34.852199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:34.852199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detailed Steps of the Fourier-Motzkin Elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tracey Ho, Xiaoli Xu, Yong Liang Guan, Yong Zeng","submitted_at":"2012-07-06T03:40:21Z","abstract_excerpt":"This file provide the detailed steps for obtaining the bounds on $R_1$, $R_2$ via the obtained results on $(R_{1c},R_{1p},R_{2c},R_{2p})$. It is subplementary material for the paper titled \"On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1512","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.1512","created_at":"2026-05-18T03:51:34.852335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1512v2","created_at":"2026-05-18T03:51:34.852335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1512","created_at":"2026-05-18T03:51:34.852335+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HSQM6P2Z7VM","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HSQM6P2Z7VMAMMY","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HSQM6P2","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU","json":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU.json","graph_json":"https://pith.science/api/pith-number/4HSQM6P2Z7VMAMMYFX3R3UWSPU/graph.json","events_json":"https://pith.science/api/pith-number/4HSQM6P2Z7VMAMMYFX3R3UWSPU/events.json","paper":"https://pith.science/paper/4HSQM6P2"},"agent_actions":{"view_html":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU","download_json":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU.json","view_paper":"https://pith.science/paper/4HSQM6P2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1512&json=true","fetch_graph":"https://pith.science/api/pith-number/4HSQM6P2Z7VMAMMYFX3R3UWSPU/graph.json","fetch_events":"https://pith.science/api/pith-number/4HSQM6P2Z7VMAMMYFX3R3UWSPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU/action/storage_attestation","attest_author":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU/action/author_attestation","sign_citation":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU/action/citation_signature","submit_replication":"https://pith.science/pith/4HSQM6P2Z7VMAMMYFX3R3UWSPU/action/replication_record"}},"created_at":"2026-05-18T03:51:34.852335+00:00","updated_at":"2026-05-18T03:51:34.852335+00:00"}