{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7FOPFAVVKVAZFST2P2MJH36TXT","short_pith_number":"pith:7FOPFAVV","schema_version":"1.0","canonical_sha256":"f95cf282b5554192ca7a7e9893efd3bcf8aac1d06f0d593fcf9c75d098ee234e","source":{"kind":"arxiv","id":"1510.00810","version":1},"attestation_state":"computed","paper":{"title":"Permanent index of matrices associated with graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tsai-Lien Wong, Xuding Zhu","submitted_at":"2015-10-03T12:19:40Z","abstract_excerpt":"A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \\in V(G) \\cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\\phi_f(v)=\\sum_{e \\in E(v)}f(e)+f(v)$. A total weighting is proper if $\\phi_f(u) \\ne \\phi_f(v)$ for any edge $uv$ of $G$. A $(k,k')$-list assignment is a mapping $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ permissible weights, and assigns to each edge $e$ a set $L(e)$ of $k'$ permissible weights. We say $G$ is $(k,k')$-choosable if for any $(k,k')$-list assignment $L$, there is a proper total weight"},"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":"1510.00810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"dee3de26c22326dd4b0241cbfaf7bdebb3d8922bbe1104904a4c4ef9d73a6dc8","abstract_canon_sha256":"2651319cb6f41025ceb04aa15ad0dcc1beb772b1c5fdf183d2a0aa5b010539cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:05.603630Z","signature_b64":"SiNbektTwIsmlawFllkLCdXdq5YuTvyd7hFEC7lsshcC4gaEybEm+f0gegXq5znpasshyRlxekv+XdsLxB2/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95cf282b5554192ca7a7e9893efd3bcf8aac1d06f0d593fcf9c75d098ee234e","last_reissued_at":"2026-05-18T01:31:05.602892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:05.602892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permanent index of matrices associated with graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tsai-Lien Wong, Xuding Zhu","submitted_at":"2015-10-03T12:19:40Z","abstract_excerpt":"A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \\in V(G) \\cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\\phi_f(v)=\\sum_{e \\in E(v)}f(e)+f(v)$. A total weighting is proper if $\\phi_f(u) \\ne \\phi_f(v)$ for any edge $uv$ of $G$. A $(k,k')$-list assignment is a mapping $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ permissible weights, and assigns to each edge $e$ a set $L(e)$ of $k'$ permissible weights. We say $G$ is $(k,k')$-choosable if for any $(k,k')$-list assignment $L$, there is a proper total weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00810","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.00810","created_at":"2026-05-18T01:31:05.603007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00810v1","created_at":"2026-05-18T01:31:05.603007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00810","created_at":"2026-05-18T01:31:05.603007+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FOPFAVVKVAZ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FOPFAVVKVAZFST2","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FOPFAVV","created_at":"2026-05-18T12:29:10.953037+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/7FOPFAVVKVAZFST2P2MJH36TXT","json":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT.json","graph_json":"https://pith.science/api/pith-number/7FOPFAVVKVAZFST2P2MJH36TXT/graph.json","events_json":"https://pith.science/api/pith-number/7FOPFAVVKVAZFST2P2MJH36TXT/events.json","paper":"https://pith.science/paper/7FOPFAVV"},"agent_actions":{"view_html":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT","download_json":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT.json","view_paper":"https://pith.science/paper/7FOPFAVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00810&json=true","fetch_graph":"https://pith.science/api/pith-number/7FOPFAVVKVAZFST2P2MJH36TXT/graph.json","fetch_events":"https://pith.science/api/pith-number/7FOPFAVVKVAZFST2P2MJH36TXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT/action/storage_attestation","attest_author":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT/action/author_attestation","sign_citation":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT/action/citation_signature","submit_replication":"https://pith.science/pith/7FOPFAVVKVAZFST2P2MJH36TXT/action/replication_record"}},"created_at":"2026-05-18T01:31:05.603007+00:00","updated_at":"2026-05-18T01:31:05.603007+00:00"}