{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LIZFZ6XBKBRJ4XNCEC3FZYWNPM","short_pith_number":"pith:LIZFZ6XB","schema_version":"1.0","canonical_sha256":"5a325cfae150629e5da220b65ce2cd7b16a330cb4329703c00ab675e4b41ebcc","source":{"kind":"arxiv","id":"1012.2142","version":1},"attestation_state":"computed","paper":{"title":"NP-completeness Proof: RBCDN Reduction Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arunabha Sen, Pavel Ghosh, Shahrzad Shirazipourazad, Sujogya Banerjee","submitted_at":"2010-12-09T23:39:32Z","abstract_excerpt":"Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete."},"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":"1012.2142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-09T23:39:32Z","cross_cats_sorted":[],"title_canon_sha256":"9e5ce86d525ac5e54d656569dd9550cd7bd3be88cba00284f4bf2aea028ac9c1","abstract_canon_sha256":"32b40bb344d4fcb152e04d7d840428b0791d526f84cba3f70600199fea7d766a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:38.456758Z","signature_b64":"Im5/0Zwtc4/y2VVibUOzk1j9Sk1iGtNnyfpDFmLX7mCAKOwro2d6V7/7MJSqkijJ3xT3g2LePi6UamD8qMaoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a325cfae150629e5da220b65ce2cd7b16a330cb4329703c00ab675e4b41ebcc","last_reissued_at":"2026-05-18T04:33:38.456097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:38.456097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-completeness Proof: RBCDN Reduction Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arunabha Sen, Pavel Ghosh, Shahrzad Shirazipourazad, Sujogya Banerjee","submitted_at":"2010-12-09T23:39:32Z","abstract_excerpt":"Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2142","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":"1012.2142","created_at":"2026-05-18T04:33:38.456181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2142v1","created_at":"2026-05-18T04:33:38.456181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2142","created_at":"2026-05-18T04:33:38.456181+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIZFZ6XBKBRJ","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIZFZ6XBKBRJ4XNC","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIZFZ6XB","created_at":"2026-05-18T12:26:10.704358+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/LIZFZ6XBKBRJ4XNCEC3FZYWNPM","json":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM.json","graph_json":"https://pith.science/api/pith-number/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/graph.json","events_json":"https://pith.science/api/pith-number/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/events.json","paper":"https://pith.science/paper/LIZFZ6XB"},"agent_actions":{"view_html":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM","download_json":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM.json","view_paper":"https://pith.science/paper/LIZFZ6XB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2142&json=true","fetch_graph":"https://pith.science/api/pith-number/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/graph.json","fetch_events":"https://pith.science/api/pith-number/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/action/storage_attestation","attest_author":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/action/author_attestation","sign_citation":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/action/citation_signature","submit_replication":"https://pith.science/pith/LIZFZ6XBKBRJ4XNCEC3FZYWNPM/action/replication_record"}},"created_at":"2026-05-18T04:33:38.456181+00:00","updated_at":"2026-05-18T04:33:38.456181+00:00"}