{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UEAXKE2QGD5PD5F5MJT7PS6P5Y","short_pith_number":"pith:UEAXKE2Q","schema_version":"1.0","canonical_sha256":"a10175135030faf1f4bd6267f7cbcfee351a6b1abdbdbe258d50d4ff2cc22760","source":{"kind":"arxiv","id":"1212.2306","version":3},"attestation_state":"computed","paper":{"title":"Agent Arrangement Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Tadashi Sakuma, Tomoki Nakamigawa","submitted_at":"2012-12-11T05:46:18Z","abstract_excerpt":"An {\\em arrangement} of an ordered pair $(G_A, G_M)$ of graphs is defined as a function $f$ from $V(G_A)$ to $V(G_M)$ such that, for each vertex $c$ of $G_M$, the vertex-set $f^{-1}(c)$ of $G_A$ either is $\\emptyset$ (the case when $c \\not\\in f(V(G_A))$) or induces a connected subgraph of $G_A$ and that the family $\\{f^{-1}(y) : y \\in V(G_M), f^{-1}(y) \\neq \\emptyset\\}$ is a partition of $V(G_A)$. Let $f$ be an arrangement of $(G_A, G_M)$, let $pq$ be an edge of $G_M$ and let $U$ be a subset of $f^{-1}(p)$ such that each of the three graphs $G_A[U]$, $G_A[f^{-1}(p)\\setminus U]$ and $G_A[f^{-1}"},"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":"1212.2306","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-11T05:46:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"53dfcc48a2a13b863fcc229eb44637ff25dda4fd653138fc062cda4ddf45d2ee","abstract_canon_sha256":"f1392dd189ed4ba395edc5e01273df4e52781c5edfc57a068b42a1a626d65615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:04.655934Z","signature_b64":"M6m6sC4MwTHcamri/wqwE7UKY/QNFSPExXeWM6zdTuYSCR3eWjOrqrDraMdHHKDgWmu0hOJIsItBKtACBaz8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a10175135030faf1f4bd6267f7cbcfee351a6b1abdbdbe258d50d4ff2cc22760","last_reissued_at":"2026-05-18T03:38:04.655120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:04.655120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Agent Arrangement Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Tadashi Sakuma, Tomoki Nakamigawa","submitted_at":"2012-12-11T05:46:18Z","abstract_excerpt":"An {\\em arrangement} of an ordered pair $(G_A, G_M)$ of graphs is defined as a function $f$ from $V(G_A)$ to $V(G_M)$ such that, for each vertex $c$ of $G_M$, the vertex-set $f^{-1}(c)$ of $G_A$ either is $\\emptyset$ (the case when $c \\not\\in f(V(G_A))$) or induces a connected subgraph of $G_A$ and that the family $\\{f^{-1}(y) : y \\in V(G_M), f^{-1}(y) \\neq \\emptyset\\}$ is a partition of $V(G_A)$. Let $f$ be an arrangement of $(G_A, G_M)$, let $pq$ be an edge of $G_M$ and let $U$ be a subset of $f^{-1}(p)$ such that each of the three graphs $G_A[U]$, $G_A[f^{-1}(p)\\setminus U]$ and $G_A[f^{-1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2306","kind":"arxiv","version":3},"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":"1212.2306","created_at":"2026-05-18T03:38:04.655258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2306v3","created_at":"2026-05-18T03:38:04.655258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2306","created_at":"2026-05-18T03:38:04.655258+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEAXKE2QGD5P","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEAXKE2QGD5PD5F5","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEAXKE2Q","created_at":"2026-05-18T12:27:23.164592+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/UEAXKE2QGD5PD5F5MJT7PS6P5Y","json":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y.json","graph_json":"https://pith.science/api/pith-number/UEAXKE2QGD5PD5F5MJT7PS6P5Y/graph.json","events_json":"https://pith.science/api/pith-number/UEAXKE2QGD5PD5F5MJT7PS6P5Y/events.json","paper":"https://pith.science/paper/UEAXKE2Q"},"agent_actions":{"view_html":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y","download_json":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y.json","view_paper":"https://pith.science/paper/UEAXKE2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2306&json=true","fetch_graph":"https://pith.science/api/pith-number/UEAXKE2QGD5PD5F5MJT7PS6P5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/UEAXKE2QGD5PD5F5MJT7PS6P5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y/action/storage_attestation","attest_author":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y/action/author_attestation","sign_citation":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y/action/citation_signature","submit_replication":"https://pith.science/pith/UEAXKE2QGD5PD5F5MJT7PS6P5Y/action/replication_record"}},"created_at":"2026-05-18T03:38:04.655258+00:00","updated_at":"2026-05-18T03:38:04.655258+00:00"}